Inverse problem for symmetric $P$-symmetric matrices with a submatrix constraint
نویسندگان
چکیده
منابع مشابه
The Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint
By using Moore-Penrose generalized inverse and the general singular value decomposition of matrices, this paper establishes the necessary and sufficient conditions for the existence of and the expressions for the centrosymmetric solutions with a submatrix constraint of matrix inverse problem AX = B. In addition, in the solution set of corresponding problem, the expression of the optimal approxi...
متن کاملThe inverse problem of nonsymmetric matrices with a submatrix constraint and its approximation
In this paper, we first give the representation of the general solution of the following least-squares problem (LSP): Given matrices X ∈ Rn×p, B ∈ Rp×p and A0 ∈ Rr×r , find a matrix A ∈ Rn×n such that ‖XTAX − B‖ = min, s. t. A([1, r]) = A0, where A([1, r]) is the r×r leading principal submatrix of the matrix A. We then consider a best approximation problem: given an n× n matrix à with Ã([1, r])...
متن کاملThe inverse eigenvalue problem for symmetric anti-bidiagonal matrices
X iv :m at h/ 05 05 09 5v 1 [ m at h. R A ] 5 M ay 2 00 5 The inverse eigenvalue problem for symmetric anti-bidiagonal matrices Olga Holtz Department of Mathematics University of California Berkeley, California 94720 USA March 6, 2008
متن کاملThe inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices
In this paper we construct the symmetric quasi anti-bidiagonal matrix that its eigenvalues are given, and show that the problem is also equivalent to the inverse eigenvalue problem for a certain symmetric tridiagonal matrix which has the same eigenvalues. Not only elements of the tridiagonal matrix come from quasi anti-bidiagonal matrix, but also the places of elements exchange based on some co...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2010
ISSN: 1370-1444
DOI: 10.36045/bbms/1290608193